2-Dimensional HP Foldings of Dermaseptin-J2

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Few Optimal Foldings of HP Protein Chains on Various Lattices ∗

We consider whether or not protein chains in the HP model have unique or few optimal foldings. We solve the conjecture proposed by Aichholzer et al. that the open chain L2k−1 = (HP )(PH) for k ≥ 3 has exactly two optimal foldings on the square lattice. We show that some closed and open chains have unique optimal foldings on the hexagonal and triangular lattices, respectively.

متن کامل

Flat 2-Foldings of Convex Polygons

A folding of a simple polygon into a convex polyhedron is accomplished by glueing portions of the perimeter of the polygon together to form a polyhedron. A polygon Q is a flat n-folding of a polygon P if P can be folded to exactly cover the surface of Q n times, with no part of the surface of P left over. In this paper we focus on a specific type of flat 2-foldings, flat 2-foldings that wrap Q;...

متن کامل

Counting Miura-ori Foldings

We consider the problem of enumerating the different ways in which the classic Miura map fold crease pattern can be folded flat. Specifically, we aim to count the number M(n,m) of ways to assign mountains and valleys to the creases so that each vertex in a m by n Miura map fold will be able to fold flat. Recurrence relations and closed formulas are found for small n and arbitrary m. We also pro...

متن کامل

Minimum Energy Configurations of the 2-Dimensional HP-Model of Proteins by Self-Organizing Networks

We use self-organizing maps (SOM) as an efficient tool to find the minimum energy configurations of the 2-dimensional HP-models of proteins. The usage of the SOM for the protein folding problem is similar to that for the Traveling Salesman Problem. The lattice nodes represent the cities whereas the neurons in the network represent the amino acids moving towards the closest cities, subject to th...

متن کامل

On the Computation of Foldings

The process of determining the development (or net) of a polyhedron or of a developable surface is called unfolding and has a unique result, apart from the placement of different components in the plane. The reverse process called folding is much more complex. In the case of polyhedra it leads to a system of algebraic equations. A given development can correspond to several or even to infinitel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Engineering

سال: 2013

ISSN: 1947-3931,1947-394X

DOI: 10.4236/eng.2013.510b016